Sufficient conditions for maximally connected dense graphsSONEOKA, T; NAKADA, H; IMASE, M et al.Discrete mathematics. 1987, Vol 63, Num 1, pp 53-66, issn 0012-365XArticle

The average connectivity of a graphBEINEKE, Lowell W; OELLERMANN, Ortrud R; PIPPERT, Raymond E et al.Discrete mathematics. 2002, Vol 252, Num 1-3, pp 31-45, issn 0012-365XArticle

On the connectivity function of a matroidSEYMOUR, P. D.Journal of combinatorial theory. Series B. 1988, Vol 45, Num 1, pp 25-30, issn 0095-8956Article

Path-connectivity in graphsHAGER, M.Discrete mathematics. 1986, Vol 59, Num 1-2, pp 53-59, issn 0012-365XArticle

Connections in acyclic hypergraphsMAIER, D; ULLMAN, J. D.Theoretical computer science. 1984, Vol 32, Num 1-2, pp 185-199, issn 0304-3975Article

Super line-connectivity properties of circulant graphsBOESCH, F. T; WANG, J. F.SIAM journal on algebraic and discrete methods. 1986, Vol 7, Num 1, pp 89-98, issn 0196-5212Article

Some recurrence formulas for probability of connectedness of random graphsKORDECKI, W.Teoriâ verojatnostej i eë primeneniâ. 1985, Vol 30, Num 3, pp 593-595, issn 0040-361XArticle

Propriétés complètes par commutation des graphesCHERNYAK, A. A.Vesci Akademii navuk BSSR. Seryâ fizika-matematyčnyh navuk. 1985, Num 1, pp 29-35, issn 0002-3574Article

Kritisch n-fach kantenzusammenhängende Graphen = Graphes n-arêtes-connexes critiques = Critically n-edge-connected graphsMADER, W.Journal of combinatorial theory. Series B. 1986, Vol 40, Num 2, pp 152-158, issn 0095-8956Article

A systolic design for connectivity problemsSAVAGE, C.IEEE transactions on computers. 1984, Vol 33, Num 1, pp 99-104, issn 0018-9340Article

A topology for computer networks with good surviability characteristics and low transmission delays between mode computersKELLY, G. L; JIANG, P.International journal of mini & microcomputers. 1983, Vol 5, Num 1, pp 12-17, issn 0702-0481Article

ENUMERATION OF GRAPHS MAXIMAL WITH RESPECT TO CONNECTIVITYHORAK P.1982; MATH. SLOV.; ISSN 0139-9918; CSK; DA. 1982; VOL. 32; NO 1; PP. 81-84; ABS. RUS; BIBL. 9 REF.Article

ON MATROID CONNECTIVITYOXLEY JG.1981; Q. J. MATH.; ISSN 0033-5606; GBR; DA. 1981; VOL. 32; NO 126; PP. 193-208; BIBL. 14 REF.Article

A SUFFICIENT CONDITION FOR A GRAPH TO BE HAMILTONIANKOEHLER N.1981; MONATSH. MATH.; ISSN 0026-9255; AUT; DA. 1981; VOL. 92; NO 2; PP. 105-116; BIBL. 5 REF.Article

UPPER EMBEDDABILITY AND CONNECTIVITY OF GRAPHSPAYAN C; NGUYEN HUY XUONG.1979; DISCRETE MATH.; NLD; DA. 1979; VOL. 27; NO 1; PP. 71-80; BIBL. 10 REF.Article

CONNECTIVITY OF DE BRUIJN NETWORKSSCHLUMBERGER M.1978; MATH. APPL. INFORMAT., RAPP. RECH.; FRA; DA. 1978; NO 154; 38 P.; ABS. FRE; BIBL. 1 REF.Serial Issue

LES HYPERGRAPHESZYKOV AA.1974; USP. MAT. NAUK; S.S.S.R.; DA. 1974; VOL. 29; NO 6; PP. 89-154; BIBL. 1 P.Article

GRAPHS AS MODEL OF COMMUNICATION NETWORK VULNERABILITY: CONNECTIVITY AND PERSISTENCEBOESCH FT; HARARY F; KABELL JA et al.1981; NETWORKS; ISSN 0028-3045; USA; DA. 1981; VOL. 11; NO 1; PP. 57-63; BIBL. 10 REF.Article

GRAPHS WITH PRESCRIBED CONNECTIVITY AND LINE GRAPH CONNECTIVITYBAUER D; TINDELL R.1979; J. GRAPH THEORY; USA; DA. 1979; VOL. 3; NO 4; PP. 393-395; BIBL. 6 REF.Article

MAXIMAL GRAPHS WITH GIVEN CONNECTIVITY AND EDGE-CONNECTIVITY.GLIVIAK F.1975; MAT. CAS.; CESKOSL.; DA. 1975; VOL. 25; NO 2; PP. 99-103; BIBL. 5 REF.Article

THE PROBABILITY OF CONNECTEDNESS OF A LARGE UNLABELLED GRAPH.WRIGHT EM.1975; J. LONDON MATH. SOC.; G.B.; DA. 1975; VOL. 11; NO 1; PP. 13-16; BIBL. 7 REF.Article

UBER SYMMETRISCHE GRAPHEN VOM GRAD FUENF. = SUR LES GRAPHES SYMETRIQUES DE VALENCE CINQWEISS RM.1974; J. COMBINATOR. THEORY, B; U.S.A.; DA. 1974; VOL. 17; NO 1; PP. 59-64; ABS. ANGL.; BIBL. 9 REF.Article

ON A STRUCTURE OF GRAPHS WITH W-SETSAKIYAMA J; ERA H.1979; TRU MATH.; JPN; DA. 1979; VOL. 15; NO 2; PP. 43-46; BIBL. 4 REF.Article

Page / 52